CompanyEFFICIENT PARALLEL JOB SCHEDULING USING GANGSERVICE

Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. To overcome some of the limitations of traditional Gang scheduling algorithms, Concurrent Gang is proposed as a class of scheduling policies which allows the exible and simultaneous scheduling of multiple parallel jobs. It hence improves the space sharing characteristics of Gang scheduling while preserving all other advantages. To provide a sound analysis of Concurrent Gang performance, a novel methodology based on the traditional concept of competitive ratio is also introduced. Dubbed dynamic competitive ratio, the new method is used to compare dynamic bin packing algorithms used in this paper. These packing algorithms apply to the Concurrent Gang scheduling of a workload generated by a statistical model. Moreover, dynamic competitive ratio is the gure of merit used to evaluate and compare packing strategies for job scheduling under multiple constraints. It will be shown that for the unidimen-sional case there is a small diierence between the performance of best t and rst t; rst t can hence be used without signiicant system degradation. For the multidimen-sional case, when memory is also considered, we concluded that the packing algorithm must try to balance the resource utilization in all dimensions simultaneously, instead of given priority to only one dimension of the problem.